翻訳と辞書 Words near each other ・ Kernan Corner, New Jersey ・ Kernascléden ・ Kernavė ・ Kerne Bridge ・ Kerne Bridge railway station ・ Kernel ・ Kernel (algebra) ・ Kernel (category theory) ・ Kernel (digital media company) ・ Kernel (EP) ・ Kernel (image processing) ・ Kernel (linear algebra) ・ Kernel (operating system) ・ Kernel (set theory) ・ Kernel (statistics) ・ Kernel adaptive filter ・ Kernel debugger ・ Kernel density estimation ・ Kernel eigenvoice ・ Kernel embedding of distributions ・ Kernel Fisher discriminant analysis ・ Kernel function for solving integral equation of surface radiation exchanges ・ Kernel Independent Transport Layer ・ Kernel marker ・ Kernel method ・ Kernel methods for vector output ・ Kernel Normal Form ・ Kernel panic ・ Kernel patch ・ Kernel Patch Protection Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Kernel adaptive filter ： ウィキペディア英語版 Kernel adaptive filter In signal processing, a kernel adaptive filter is a type of nonlinear adaptive filter. An adaptive filter is a filter that adapts its transfer function to changes in signal properties over time by minimizing an error or loss function that characterizes how far the filter deviates from ideal behavior. The adaptation process is based on learning from a sequence of signal samples and is thus an online algorithm. A nonlinear adaptive filter is one in which the transfer function is nonlinear. Kernel adaptive filters implement a nonlinear transfer function using kernel methods.〔 In these methods, the signal is mapped to a high-dimensional linear feature space and a nonlinear function is approximated as a sum over kernels, whose domain is the feature space. If this is done in a reproducing kernel Hilbert space, a kernel method can be a universal approximator for a nonlinear function. Kernel methods have the advantage of having convex loss functions, with no local minima, and of being only moderately complex to implement. Because high-dimensional feature space is linear, kernel adaptive filters can be thought of as a generalization of linear adaptive filters. As with linear adaptive filters, there are two general approaches to adapting a filter: the least mean squares filter (LMS) and the recursive least squares filter (RLS). There is also an approach that employs a projection-based rationale, i.e., the Kernel Adaptive Projected Subgradient method, which can incorporate more general (possibly non-differentiable) loss functions. Among these three general approaches a number of variants have been created, including: Naive Online regularized Risk Minimization Algorithm (NORMA), Quantized KLMS (QKLMS), Approximate Linear Dependency KRLS (ALD-KRLS), Sliding-Window KRLS (SW-KRLS), Fixed-Budget KRLS (FB-KRLS), the KRLS Tracker (KRLS-T) algorithm, the Quantized APSM,〔 e.t.c. There is also variants that can treat complex data, like the Complex Kernel LMS, the widely linear (or augmented) Complex Kernel LMS and the complex Kernel APSM. Source code (in Matlab) for some of the aforementioned algorithms together with relative experiments on synthetic data can be downloaded from (here ). == References == 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Kernel adaptive filter」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.